Constraint contextual rewriting

Constraint contextual rewriting

Termination of Constraint Contextual Rewriting

Abstra t. The e e tive integration of de ision pro edures in formula simpli ation is a fundamental problem in me hani al veri ation. The main sour e of diÆ ulty o urs when the de ision pro edure is asked to solve goals ontaining symbols whi h are interpreted for the prover but uninterpreted for the de ision pro edure. To ope with the problem, Boyer & Moore proposed a te hnique, alled augmentati...

Contextual Rewriting in SPASS

Graph Rewriting with Contextual Refinement

In the standard theory of graph transformation, a rule modifies only subgraphs of constant size and fixed shape. The rules supported by the graph-rewriting tool GRGEN are far more expressive: they may modify subgraphs of unbounded size and variable shape. Therefore properties like termination and confluence cannot be analyzed as for the standard case. In order to lift such results, we formalize...

Constraint design rewriting

We propose an algebraic approach to the design and transformation of constraint networks, inspired by Architectural Design Rewriting. The approach can be understood as (i) an extension of ADR with constraints, and (ii) an application of ADR to the design of reconfigurable constraint networks. The main idea is to consider classes of constraint networks as algebras whose operators are used to den...